Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
نویسندگان
چکیده
منابع مشابه
A Case for Strongly Polynomial Time Sub-Polyhedral Scheduling Using Two-Variable-Per-Inequality Polyhedra
We make a case for sub-polyhedral scheduling using (Unit-)TwoVariable-Per-Inequality or (U)TVPI Polyhedra. We empirically show that using general convex polyhedra leads to a scalability problem in a widely used polyhedral scheduler. We propose methods in which polyhedral schedulers can beat the scalability challenge by using sub-polyhedral under-aproximations of the polyhedra resulting from the...
متن کاملThe Two Variable Per Inequality
This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...
متن کاملThe two variable per inequality abstract domain
This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...
متن کاملA Unit Two Variable per Inequality Integer Constraint Solver for Constraint Logic Programming
One of the problems with the traditional nite domains approach to solving integer problems in a constraint logic programming context is that all variables require explicit bounds. If no explicit bounds are available then the nite domain solver can be very ineecient on certain classes of problem. We present an alternative approach to solving integer constraints based on a polynomial-time solver ...
متن کاملMINES ParisTech
The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our algorithms operate is the polyhedral model of compilation which has been successful in the design and implementation of complex loop nest optimizers and parallelizing compilers. The algorithmic complexity and scalability limitations of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2480359.2429127